package BinaryTree;

public class Main {
	public static void main(String args[]) {
		String[] prelist = { "A", "B", "D", "G", "C", "E", "F", "H" };
		String[] inlist = { "D", "G", "B", "A", "E", "C", "H", "F" };
		BinaryTree<String> bitree = new BinaryTree<String>(prelist, inlist);

		bitree.preOrder();
		bitree.inOrder();
		bitree.postOrder();
		System.out.println("结点个数是" + bitree.count() + "，高度是" + bitree.height());
	}
}
